Morphological Earley - based Chart Parsing in Connected Word Recognition 1
نویسنده
چکیده
منابع مشابه
An Augmented Chart Data Structure with Efficient Word Lattice Parsing Scheme In Speech Recognition Applications
In this paper, an augmented chart data structure with efficient word lattice parsing scheme in speech recognition applications is proposed. The augmented chart and the associated parsing, algorithm can represent and parse very efficiently a lattice of word hypotheses produced in speech recognition with high degree of lexical ambiguity .without changing the fundamental principles of chart parsin...
متن کاملA Structured Language Model Based on Context-Sensitive Probabilistic Left-Corner Parsing
Recent contributions to statistical language modeling for speech recognition have shown that probabilistically parsing a partial word sequence aids the prediction of the next word, leading to “structured” language models that have the potential to outperform n-grams. Existing approaches to structured language modeling construct nodes in the partial parse tree after all of the underlying words h...
متن کاملLattice Parsing to Integrate Speech Recognition and Rule-Based Machine Translation
In this paper, we present a novel approach to integrate speech recognition and rulebased machine translation by lattice parsing. The presented approach is hybrid in two senses. First, it combines structural and statistical methods for language modeling task. Second, it employs a chart parser which utilizes manually created syntax rules in addition to scores obtained after statistical processing...
متن کاملEarley Deduction
This paper first reviews Earley Deduction, a generalization of the Earley Parsing Algorithm to the execution of Horn Clause Logic Programs. Earley Deduction is both sound and—unlike the standard Prolog interpreter—complete; proofs of this are included. For functor-free programs, the method is also guaranteed to terminate. (The functor-free subset of Prolog is called DATALOG and can be used to c...
متن کاملAn Earley Parsing Algorithm for Range Concatenation Grammars
We present a CYK and an Earley-style algorithm for parsing Range Concatenation Grammar (RCG), using the deductive parsing framework. The characteristic property of the Earley parser is that we use a technique of range boundary constraint propagation to compute the yields of non-terminals as late as possible. Experiments show that, compared to previous approaches, the constraint propagation help...
متن کامل